Analogue algorithm for parallel factorization of an exponential number of large integers: II - optical implementation
نویسنده
چکیده
We report a detailed analysis of the optical realization [22,31,30, 24] of the analogue algorithm described in the first paper of this series [21] for the simultaneous factorization of an exponential number of integers. Such an analogue procedure, which scales exponentially in the context of first order interference, opens up the horizon to polynomial scaling by exploiting multiparticle quantum interference.
منابع مشابه
Analogue algorithm for parallel factorization of an exponential number of large integers: I. Theoretical description
We describe a novel analogue algorithm that allows the simultaneous factorization of an exponential number of large integers with a polynomial number of experimental runs. It is the interference-induced periodicity of “factoring” interferograms measured at the output of an analogue computer that allows the selection of the factors of each integer [26,35,34,28]. At the present stage the algorith...
متن کاملArea–time efficient hardware architecture for factoring integers with the elliptic curve method
Since the introduction of public key cryptography, the problem of factoring large composites has been of increased interest. The security of the most popular asymmetric cryptographic scheme RSA depends on the hardness of factoring large numbers. The best known method for factoring large integers is the general number field sieve (GNFS). One important step within the GNFS is the factorization of...
متن کاملA parallel line sieve for the GNFS Algorithm
RSA is one of the most important public key cryptosystems for information security. The security of RSA depends on Integer factorization problem, it relies on the difficulty of factoring large integers. Much research has gone into problem of factoring a large number. Due to advances in factoring algorithms and advances in computing hardware the size of the number that can be factorized increase...
متن کاملOptimized Implementation of the Elliptic Curve Factorization Method on a Highly Parallelized Hardware Cluster
In this thesis we present a highly efficient, parallel implementation of the elliptic curve method (ECM) on reconfigurable hardware in order to support the general number field sieve algorithm (GNFS). The GNFS is the most effective algorithm to factor large integers. It can be used to attack the RSA cryptosystem by factoring the composite RSA modulus N = p · q. During the sieving step, a large ...
متن کاملElliptic Curve Method for Integer Factorization on Parallel Architectures
The elliptic curve method (ECM) for integer factorization is an algorithm that uses the algebraic structure of the set of points of an elliptic curve for factoring integers. The running time of ECM depends on the size of the smallest prime divisor of the number to be factored. One of its main applications is the co-factorization step in the number field sieve algorithm that is used for assessin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Quantum Information Processing
دوره 15 شماره
صفحات -
تاریخ انتشار 2016